#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int n, a[N], ans;
priority_queue<int, vector<int>, greater<int> > st;
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++){
        scanf("%d", &a[i]);
    }
    sort(a+1, a+n+1);
    st.push(a[1]);
    for(int i=2; i<=n; i++){
        if(a[i] > st.top()) st.pop();
        st.push(a[i]);
    }
    ans = st.size();
    printf("%d", ans);
    return 0;
}
